Quantum algorithms for testing Boolean functions
نویسندگان
چکیده
We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2n possible linear Boolean functions of n variables; given a linear Boolean function, the Bernstein-Vazirani quantum algorithm can deterministically identify which one of these Boolean functions we are given using just one single function query. The same quantum algorithm can also be used to learn which input variables other types of Boolean functions depend on, with a success probability that depends on the form of the Boolean function that is tested, but does not depend on the total number of input variables. We also outline a procedure to futher amplify the success probability, based on another quantum algorithm, the Grover search.
منابع مشابه
.1 Property Testing
My field of research is Theoretical Computer Science. My focus has been in the classical and quantum complexity of Boolean functions (including property testing, sensitivity and block sensitivity of Boolean functions and quantum database search), in electronic commerce, in graph algorithms and in coding theory. I have designed effective algorithms as well as proved lower bounds for the complexi...
متن کاملAlgorithms for Quantum Branching Programs Based on Fingerprinting
In the paper we develop a method for constructing quantum algorithms for computing Boolean functions by quantum ordered read-once branching programs (quantum OBDDs). Our method is based on fingerprinting technique and representation of Boolean functions by their characteristic polynomials. We use circuit notation for branching programs for desired algorithms presentation. For several known func...
متن کاملQuantum Algorithms for Learning and Testing Juntas
In this article we develop quantum algorithms for learning and testing juntas, i.e. Boolean functions which depend only on an unknown set of k out of n input variables. Our aim is to develop efficient algorithms: • whose sample complexity has no dependence on n, the dimension of the domain the Boolean functions are defined over; • with no access to any classical or quantum membership (“black-bo...
متن کاملQuantum conditional query complexity
We define and study a new type of quantum oracle, the quantum conditional oracle, which provides oracle access to the conditional probabilities associatedwith an underlying distribution. Amongst other properties, we (a) obtain speed-ups over the best known quantum algorithms for identity testing, equivalence testing and uniformity testing of probability distributions; (b) study the power of the...
متن کاملQuantum boolean functions
In this paper we introduce the study of quantum boolean functions, which are unitary operators f whose square is the identity: f = I. We describe several generalisations of well-known results in the theory of boolean functions, including quantum property testing; a quantum version of the Goldreich-Levin algorithm for finding the large Fourier coefficients of boolean functions; and two quantum v...
متن کامل